منابع مشابه
Irregular labelings of circulant graphs
([3]) and tvs(G) ≤ ⌈ 3n δ ⌉ + 1 ([1]). The exact values for some families of graphs are also known, e.g. the value of s(Cin(1, k), given in [2]. We prove that tvs(Cin(1, 2, . . . , k)) = n+2k 2k+1 , while s(Cin(1, 2, . . . , k)) = n+2k−1 2k . In order to do that, we split the graph Cin(1, 2, . . . , k) into segments and label each segment using 0, 1 and 2 in such a way that the weighted degrees...
متن کاملGraceful labelings of the generalized Petersen graphs
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...
متن کاملNeighbourly Irregular Derived Graphs
A connected graph G is said to be neighbourly irregular graph if no two adjacent vertices of G have same degree. In this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
متن کاملLucky labelings of graphs
Suppose the vertices of a graph G were labeled arbitrarily by positive integers, and let S(v) denote the sum of labels over all neighbors of vertex v. A labeling is lucky if the function S is a proper coloring of G, that is, if we have S(u) 6= S(v) whenever u and v are adjacent. The least integer k for which a graph G has a lucky labeling from the set f1; 2; : : : ; kg is the lucky number of G,...
متن کاملConstructions of antimagic labelings for some families of regular graphs
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2015
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2015.11.010